Final Year Project

Project Title

Bounds of Description Complexity of Quantum Finite Automata Using Communication Complexity Techniques

Description

Suppose that some information is distributed uniformly between n people and they do not have access to each other’s information. Their collective goal is to make some decisions based on the shared information. One easy way would be to transmit all the information to the n-th person and he/she makes the decision. While this would allow the decision to be taken perfectly, it would require all the information to be transmitted once, which is costly. In their capstone project, Amin and Affan explore how we can reduce the amount of information being transmitted and the probability of making a correct decision based on partial information. This is a joint project with Affan Aslam.